Descriptors for point processes based on runs: the Markovian arrival process

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Insurance Claim Settlement Process with Markovian Arrival Processes

This paper proposes a model for the claim occurrence, reporting, and handling process of insurance companies. It is assumed that insurance claims occur according to a Markovian arrival process. An incurred claim goes through some stages of a claim reporting and handling process, such as Incurred But Not Reported (IBNR), Reported But Not Settled (RBNS) and Settled (S). We derive formulas for the...

متن کامل

Batch Markovian Arrival Processes (BMAP)

This article describes the batch Markovian arrival process (BMAP), a point process that is characterized by Markov-modulated batch arrivals of random size. The BMAP is a generalization of many well-known processes including the Markovian arrival process (MAP), the Poisson process, and the Markov-modulated Poisson process. It provides a common framework for modeling arrival processes in a variet...

متن کامل

Approximate Model for Merging Markovian Arrival Processes

Traffic-based decomposition models encompass procedures required for modelling of the basic network operations of superposition, departure and splitting, arising due to the common sharing of the resources and routing decisions taking place in packetswitched networks. It is desirable to study such models for Markovian Arrival Processes (MAPs), as these processes are able to match correlations an...

متن کامل

Filtering and the EM-algorithm for the Markovian arrival process

In this paper, we deal with the so-called Markovian Arrival process (MAP). An MAP is thought of as a partially observed Markov process, so that the ExpectationMaximization (EM) algorithm is a natural way to estimate its parameters. Then, non-linear filters of basic statistics related to the MAP must be computed. The forward-backward principle is the basic way to do it. Here, bearing in mind a f...

متن کامل

Markovian Queues with Correlated Arrival Processes

In an attempt to examine the effect of dependencies in the arrival process on the steady state queue length process in single server queueing models with exponential service time distribution, four different models for the arrival process, each with marginally distributed exponential interarrivals to the queueing system, are considered. Two of these models are based upon the upper and lower bou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Mathematics and Stochastic Analysis

سال: 1996

ISSN: 1048-9533,1687-2177

DOI: 10.1155/s104895339600041x